On h-antimagicness of disconnected graphs

Title: On h-antimagicness of disconnected graphs
Creator: Bača, Martin; Miller, Mirka; Ryan, Joe; Semaničová-Feňovčíková, Andrea
Relation: Bulletin of the Australian Mathematical Society Vol. 94, Issue 2, p. 201-207
Publisher Link: http://dx.doi.org/10.1017/S0004972716000204
Publisher: Cambridge University Press
Resource Type: journal article
Date: 2016
Description: A simple graph G = (V; E) admits an H-covering if every edge in E belongs to at least one subgraph of G isomorphic to a given graph H. Then the graph G is (a, d)-H-antimagic if there exists a bijection f : V ∪ E → {1, 2,..., ⏐V⏐ + ⏐E⏐} such that, for all subgraphs H' of G isomorphic to H, the H-weights, wt_f(H') = Σ_v∈(H') f(v)+Σ_e∈(H') f(e) form an arithmetic progression with the initial term a and the common difference d. When f(V) = {1, 2,...,⏐V⏐}, then G is said to be super (a, d)-H-antimagic. In this paper, we study super (a, d)-H-antimagic labellings of a disjoint union of graphs for d = ⏐E(H)⏐ - ⏐V(H)⏐.
Subject: H-covering; (super) (a; d)-H-antimagic labelling; union of graphs
Identifier: http://hdl.handle.net/1959.13/1339541
Identifier: uon:28279
Identifier: ISSN:0004-9727
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format